例文
- もっと例文: 1 2 3 4 5
- Let G _ 0 be the set of reduced words.
- We shall show that each equivalence class of words contains exactly one reduced word.
- It will suffice then to show that distinct reduced words u and v are not equivalent.
- Every element of the free group can be written uniquely as a reduced word in " S ".
- Every element g \ in F is represented by a unique reduced word, and this reduced word is the shortest word representing g.